| 翻訳と辞書 |
| Life without Death ： ウィキペディア英語版 |
Life without Death
''Life without Death'' is a cellular automaton, similar to Conway's Game of Life and other MCell lexicon of Cellular Automata rules ).〕 In contrast to the more complex patterns that exist within Conway's Game of Life, Life without Death commonly features still life patterns, in which no change occurs, and ''ladder'' patterns, that grow in a straight line.
==Rules==
A cellular automaton is a type of model studied in mathematics and theoretical biology consisting of a regular grid of cells, each in one of a finite number of states, such as "On" and "Off". A pattern in the Life without Death cellular automaton consists of an infinite two-dimensional grid of cells, each of which can be in one of two states: dead or alive. Equivalently, it can be thought of as an array of pixels, each of which may be black and white; in the figures, the white pixels represent live cells while the black pixels represent dead cells. Two of these cells are considered to be ''neighbors'' if they are vertically, horizontally, or diagonally adjacent.〔This definition of neighbours is known as the Moore neighborhood〕
Any such pattern changes over a sequence of time steps by applying the following simple rules simultaneously to all cells of the pattern: every cell that was alive in the previous pattern remains alive, every dead cell that has exactly three live neighbors becomes alive itself, and every other dead cell remains dead. That is, in the notation describing Life-like}} cellular automaton rules, it is rule B3/S012345678: a live cell is born when there are three live neighbors, and a live cell survives with any number of neighbors.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Life without Death」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|